Performance Assessment of Dynamic Flexible Assembly Job Shop Control Methods
نویسندگان
چکیده
منابع مشابه
Flexible Assembly Job Shop Scheduling Based on Tabu Search
Flexible assembly job shop scheduling has been proved to be an NP-hard problem. To reduce the complexity, it is always divided into 2 sub-problems: routing sub-problem and sequencing sub-problem. In this paper, in order to develop a solution with high accuracy, we propose a method that can deal with these two sub-problems concurrently. Tabu search, one of the meta-heuristics, is adopted. Some e...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملthe role of application of dynamic assessment approach in improvement of iranian efl writing performance at different language proficiency levels
the present study sought to investigate the role of dynamic assessment (da) in improvement of iranian efl writing performance at different language proficiency levels. to this end, after conducting the quick placement test, 60 iranian efl learners were assigned to two groups with different language proficiency levels. in both groups each participant wrote two compositions, one before and one af...
Reactive Search for Flexible Job Shop Scheduling
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3043880